Weak persistency semantics from the ground up: formalising the persistency semantics of ARMv8 and transactional models
نویسندگان
چکیده
منابع مشابه
Towards Data Persistency for Fault-tolerance Using MPI Semantics
As the size and complexity of high-performance computing hardware, as well as applications increase, the likelihood of a hardware failure during the execution time of large distributed applications is no longer negligible. On the other hand, frequent checkpointing of full application state or even full compute node memory is prohibitively expensive. Thus, application-level checkpointing of only...
متن کاملThe Semantics of Transactions and Weak Memory in x86, Power, ARMv8, and C++
Weak memory models trade programmability for performance, while transactional memory (TM) aims for ease of programming, sometimes at a performance cost. The semantics of both have been studied in detail, but their combined semantics is not well understood. This is problematic because TM is currently available, either natively or via extensions, in widely-used architectures and languages such as...
متن کاملThe Semantics of the Goodness and the Ugly
There are different views concerning the meanings of the most important ethical concepts such as the goodness and the ugly. The author of this article while classifying various views and explaining them, tries to make a critical study of those views as well. Accordingly, first he goes on to examine critically the theory of emotionalists as one of the most important non-cognitive theories. Th...
متن کاملPersistency and Nonviolence Decision Problems in P/T-Nets with Step Semantics
Persistency is one of the notions widely investigated due to its application in concurrent systems. The classical notion refers to nets with a standard sequential semantics. We will present two approaches to the issue (nonviolence and persistency). The classes of different types of nonviolence and persistency will be defined for nets with step semantics. We will prove that decision problem conc...
متن کاملPersistency of Connuence 1
A property P of term rewriting systems (TRSs, for short) is said to be persistent if for any many-sorted TRS R, R has the property P if and only if its underlying unsorted TRS (R) has the property P. This notion was introduced by H. Zantema (1994). In this paper, it is shown that con uence is persistent.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2019
ISSN: 2475-1421
DOI: 10.1145/3360561